1401A - Distance and Axis - CodeForces Solution


constructive algorithms math *900

Please click on ads to support us..

Python Code:

t = int(input())

for _ in range(t):
    a, b = map(int, input().split())

    if a <= b:
        print(b - a)
    elif a % 2 == b % 2:
        print(0)
    else:
        print(1)

C++ Code:

#include <bits/stdc++.h>
#define ll long long int

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--) {
        ll n, k;
        cin >> n >> k;
        if(n <= k) {
            cout << k - n << "\n";
            continue;
        }
        ll x = 0;
        while(2 * x + k <= n) {
            x++;
        }
        ll a1 = 2 * x + k;
        ll a2 = 2 * (x - 1) + k;
        cout << min(abs(a1 - n), abs(a2 - n)) << "\n";
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

298B - Sail
239A - Two Bags of Potatoes
1704E - Count Seconds
682A - Alyona and Numbers
44A - Indian Summer
1133C - Balanced Team
1704A - Two 0-1 Sequences
1467A - Wizard of Orz
1714E - Add Modulo 10
1714A - Everyone Loves to Sleep
764A - Taymyr is calling you
1714B - Remove Prefix
1264F - Beautiful Fibonacci Problem
52A - 123-sequence
1543A - Exciting Bets
1714D - Color with Occurrences
215B - Olympic Medal
1445A - Array Rearrangment
1351A - A+B (Trial Problem)
935B - Fafa and the Gates
1291A - Even But Not Even
1269A - Equation
441A - Valera and Antique Items
1702C - Train and Queries
816B - Karen and Coffee
838D - Airplane Arrangements
148B - Escape
847G - University Classes
1110A - Parity
1215B - The Number of Products